Constructing minimum changeover cost arborescenses in bounded treewidth graphs
نویسندگان
چکیده
منابع مشابه
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs
Given an edge-colored graph, a vertex on a path experiences a reload cost if it lies between two consecutive edges of different colors. The value of the reload cost depends only on the colors of the traversed edges. Reload cost has important applications in dynamic networks, such as transportation networks and dynamic spectrum access networks. In the minimum changeover cost arborescence (MinCCA...
متن کاملOn the complexity of constructing minimum changeover cost arborescences
a r t i c l e i n f o a b s t r a c t The reload cost concept refers to the cost that occurs at a vertex along a path on an edge-colored graph when it traverses an internal vertex between two edges of different colors. This cost depends only on the colors of the traversed edges. Reload costs arise in various applications such as transportation networks, energy distribution networks, and telecom...
متن کاملRecoloring bounded treewidth graphs
Let k be an integer. Two vertex k-colorings of a graph are adjacent if they differ on exactly one vertex. A graph is k-mixing if any proper k-coloring can be transformed into any other through a sequence of adjacent proper k-colorings. Any graph is (tw + 2)-mixing, where tw is the treewidth of the graph (Cereceda 2006). We prove that the shortest sequence between any two (tw + 2)-colorings is a...
متن کاملOn Minimum Changeover Cost Arborescences
We are given a digraph G = (N, A), where each arc is colored with one among k given colors. We look for a spanning arborescence T of G rooted at a given node and having minimum changeover cost. We call this the Minimum Changeover Cost Arborescence problem. To the authors’ knowledge, it is a new problem. The concept of changeover costs is similar to the one, already considered in the literature,...
متن کاملDefensive Alliances in Graphs of Bounded Treewidth
A set S of vertices of a graph is a defensive alliance if, for each element of S, the majority of its neighbors is in S. The problem of finding a defensive alliance of minimum size in a given graph is NP-hard and there are polynomial-time algorithms if certain parameters are bounded by a fixed constant. In particular, fixed-parameter tractability results have been obtained for some structural p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.01.022